Termination w.r.t. Q proof of TRS/Rubionestrec.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(g₁(X)) -> g₁(f₁(f₁(X)))
f₁(h₁(X)) -> h₁(g₁(X))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(g₁(X)) -> g₁(f₁(f₁(X)))
f₁(h₁(X)) -> h₁(g₁(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F₁(g₁(X)) -> F₁(f₁(X))
F₁(g₁(X)) -> F₁(X)

The TRS R consists of the following rules:

f₁(g₁(X)) -> g₁(f₁(f₁(X)))
f₁(h₁(X)) -> h₁(g₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F₁(g₁(X)) -> F₁(f₁(X))
F₁(g₁(X)) -> F₁(X)

The TRS R consists of the following rules:

f₁(g₁(X)) -> g₁(f₁(f₁(X)))
f₁(h₁(X)) -> h₁(g₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

F₁(g₁(X)) -> F₁(f₁(X))
F₁(g₁(X)) -> F₁(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(F₁(x₁)) = x₁
POL(f₁(x₁)) = x₁
POL(g₁(x₁)) = 2 + x₁
POL(h₁(x₁)) = 0

The following usable rules [14] were oriented:

f₁(h₁(X)) -> h₁(g₁(X))
f₁(g₁(X)) -> g₁(f₁(f₁(X)))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

        ↳ QDP

          ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f₁(g₁(X)) -> g₁(f₁(f₁(X)))
f₁(h₁(X)) -> h₁(g₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.